package com.berchen.数据结构.二叉树.二叉排序树;

public class BinarySortTreeTest {
    public static void main(String[] args) {

        BinarySortTree tree=new BinarySortTree();
        int[] arr={7,3,10,12,5,1,9};
        for(int i =0;i<arr.length;i++){
            tree.add(new BinarySortNode(arr[i]));
        }
//        tree.infixOrder();

        System.out.println("=========");
//        System.out.println(tree.getMinNode(tree.getRoot(), true));

        tree.delNode(7);
        tree.infixOrder();

//        System.out.println(tree.getDelParent(1));
    }

}
